Contractor Rebrt : 181763 ICASE REPORT
نویسندگان
چکیده
In this paper, we extend the class of problenis t h a t can be effcrtively m n piled by parallelizing compilers. This is accornplislictl with the doconsider coi l st ruct which would allow these compilers t o paralldizc~ many prohlcnis i n \v l i i t 11 siil)staiitial loop-lcvel parallelisin is available h i t cattnot bc tlctcctctl hy staiitl;irtl corn pile-t iriie analysis. \Ire describe and espcriincii till I J analyze mcdia nisni.; I I srd to parallclize the work required for these types of loops. I n each of t hcse met Iiotls. a new loop structure is produced hy modifying the loop to be parallclizcd. \\'P also prcscnt t he rules by wliicli these loop transformations may be autoiiiatcd i n oi t1c.r. tha t they be iriclridccl in langiiage conipilers. Tlic i t i a i i i application a1c.n of o u r wscarcli involves problems i n scientific computations aittl engineering. The wot kIo;it l iiscd i n our experirnents iitcludcs a mixture of real ~)i~)l)lcins as wc4l as synt 1101 i rally gcncratetl inputs. I2rorn our estcwsivc tests oii t l i t 1 I:iicorc hl i i l t i i t t ; i s / : l~ (~ , IVV have reaclicd t he conclusion tha t for t he types of \voi liloatls \vv Iiavc. i t ivfs l igat ( V I , self-execution almost always perforins better tltitii ~~tc~-sc~l iccl i~l i~ig. b'iirtlier. 1 I I V i r i i provcment in performance t h a t accriics as a resiil t of global topological sori irig of indices as opposed to the less experisivc local sortiiig. is not very sigiiifirant i r i t I I P case of self-execution. 'This research was supported by the U.S. Office of Naval Research under Grant N0001486K-0310, the United States Air Force Office of Scientific Research under Contract NO. AFOSR Grant No. AFOSR 88-0117, and the National Aeronautics and Space Administration under NASA Contract No. NAS1-18107 while the first author was in residence a t the Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665.
منابع مشابه
ICASE Report #94-44 NASA Contractor Report #194929 On the Utility of the Multi-Level Algorithm for the Solution of Nearly Completely Decomposable Markov Chains
Recently the Multi-Level algorithm was introduced as a general purpose solver for the solution of steady state Markov chains. In this paper we consider the performance of the Multi-Level algorithm for solving Nearly Completely Decomposable (NCD) Markov chains, for which special-purpose iterative aggregation/disaggregation algorithms such as the Koury-McAllisterStewart (KMS) method have been dev...
متن کاملICASE Report #93-81 NASA Contractor Report #191558 A Multi-Level Solution Algorithm for Steady-State Markov Chains
A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial di erential equations. Initial results of numerical exper...
متن کاملPreconditioning for the Fluid Dynamic Equations
The selection of articles for this issue of the ICASE Research Quarterly departs from the previous policy of presenting technical articles covering a variety of active research areas at ICASE; instead, the articles are devoted to a single topic: convergence acceleration in CFD. The articles for this special issue, solicited by Dr. Jim Jones, Staa Scientist at ICASE, discuss convergence accelera...
متن کاملA descriptive model for determining optimal human performance in systems. Volume IV. Final summary report. NASA CR-879.
متن کامل
ICASE Report No . 90 - 59 182100 ICASE MULTIPROCESSORS AND RUNTIME COMPILATION Joel Saltz
Runtime time preprocessing plays a major role in many efficient algorithms in computer science, as well as playing an important role in exploiting multiprocessor architectures. We give examples that elucidate the importance of run time preprocessing and show how these optimizations can be integrated into compilers. To support our arguments, we describe transformations implemented in prototype m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991